A modified inexact Uzawa A lgorithm for generalized saddle point problems
نویسنده
چکیده
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171]. Keywords—Saddle point problem; Inexact Uzawa algorithm; Convergence behavior.
منابع مشابه
A Modified Preconditioner for Parameterized Inexact Uzawa Method for Indefinite Saddle Point Problems
The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose ...
متن کاملGlobal and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondiierentiable Mappings
This paper investigates inexact Uzawa methods for nonlinear saddle point problems. We prove that the inexact Uzawa method converges globally and superlinearly even if the derivative of the nonlinear mapping does not exist. We show that the Newton-type decomposition method for saddle point problems is a special case of a Newton-Uzawa method. We discuss applications of inexact Uzawa methods to se...
متن کاملAn Inexact Uzawa-Type Iterative Method for Solving Saddle Point Problems
As an extension of the inexact Uzawa algorithm addressed in 1], we propose an improved inexact Uzawa-type iterative method for solving saddle point problems. The convergence rate is given in terms of the rates of the two basic iterations as deened in 1], and it is shown that the new algorithm always converges as long as the two basic iterations converge. A running title: Uzawa algorithm for sad...
متن کاملConvergence Analysis of the Modified Nonlinear Inexact Uzawa Algorithm for Saddle Point Problem
This paper focuses on the convergence of the modified nonlinear inexact Uzawa algorithm (MNIU) for solving the saddle point problem. We improve the sufficient conditions for convergence and the convergence rate shown in Bramble et al. [J. Bramble, J. Pasciak, and A. Vassilev, Analysis of the inexact Uzawa algorithm for saddle point problems, SIAM J. Numer. Anal., 34 (1997), pp. 1072–1092] and Y...
متن کاملOn preconditioned Uzawa methods and SOR methods for saddle-point problems
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondi erentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble– Pasciak–Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the...
متن کامل